On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
نویسندگان
چکیده
Nowadays, graph theory is one of the most exciting fields mathematics due to tremendous developments in modern technology, where it used many important applications. The orthogonal double cover (ODC) a branch and considered as special class decomposition. In this paper, we decompose complete bipartite graphs Kx,x by caterpillar using method ODCs. article also deals with constructing ODCs general symmetric starter vectors such stars–caterpillar, disjoint copies cycles–caterpillars, graphs, paths. We subgraphs vectors. advantage some these new results that they enable us giant networks into large groups small comprehensive coverage all parts network subgraphs. use case applying described for various applications considered.
منابع مشابه
Orthogonal double covers of complete bipartite graphs
Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...
متن کاملOrthogonal double covers of complete bipartite graphs by the union of a cycle and a star
Abstract Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members of G share exactly an edge whenever the corresponding vertices are adjacent in H. If all subgraphs in G are isomorphic to a given spanning subgraph G, then G is said to be an...
متن کاملOrthogonal double covers of complete graphs by fat catepillars
An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...
متن کاملOrthogonal Double Covers of Complete Graphs by Fat Caterpillars
An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...
متن کاملOrthogonal Double Covers of Complete Graphs by Trees
Gronau, Mullin, and Rosa conjectured that for every tree T with n vertices except for P4 there exists an ODC of Kn by T . They also proved the conjecture for all caterpillars of diameter 3. Later, Leck and Leck proved it for all caterpillars of diameter 4 and all trees with up to 14 vertices. We prove the conjecture for all carerpillars of diameter 5 and order n ≥ 24; for orders 15 ≤ n ≤ 23 we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2023
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a16070320